Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm
نویسندگان
چکیده
! " # $ % & '% &( % & # ) % & % & !
منابع مشابه
Fuzzy Equi–Join and Its Evaluation
We propose a new measure of fuzzy equality comparison based on the similarity of possibility distributions. we define a fuzzy equi–join based on the new fuzzy equality comparison, and allow threshold values to be associated with predicates of the join condition. A sort–merge join algorithm based on a partial order of intervals is used to evaluate the fuzzy equi-join. In order for the evaluation...
متن کاملParallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join and Sort Merge Join algorithm in a Grid Environment. We concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. Based on these results the paper proves that by sma...
متن کاملMulti-Core, Main-Memory Joins: Sort vs. Hash Revisited
In this paper we experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-)hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multicore architectures, it has been argued that sort-merge join is now a better choice than radix-hash join. This...
متن کاملA Dynamically Reconfigurable Equi-Joiner on FPGA
As the increase of clock frequencies has slowed, special purpose hardware circuits are becoming increasingly important to accelerate the performance of computing systems. In this context, FPGAs offer advantages over hardcoded ASICs, since FPGAs allow us to use the entire chip to implement optimized algorithms for specific inputs by reconfiguring the circuits at runtime. For example, relational ...
متن کاملHeap-Filter Merge Join: A new algorithm for joining medium-size relations
We present a new algorithm for relational equi-join. The algorithm is a modification of merge join but promises superior performance for medium-size relations. In many cases, it even compares favorably with hybrid hash join.
متن کامل